Weighted First-Order Model Counting in the Two-Variable Fragment With Counting Quantifiers
نویسندگان
چکیده
It is known due to the work of Van den Broeck, Meert and Darwiche that weighted first-order model counting (WFOMC) in two-variable fragment logic can be solved time polynomial number domain elements. In this paper we extend result with quantifiers.
منابع مشابه
Two-Variable First Order Logic with Counting Quantifiers: Complexity Results
Etessami, Vardi and Wilke [5] showed that satisfiability of two-variable first order logic FO[<] on word models is Nexptime-complete. We extend this upper bound to the slightly stronger logic FO[<, succ,≡], which allows checking whether a word position is congruent to r modulo q, for some divisor q and remainder r. If we allow the more powerful modulo counting quantifiers of Straubing, Thérien ...
متن کاملComplexity of the Two-Variable Fragment with Counting Quantifiers
The satisfiability and finite satisfiability problems for the two-variable fragment of firstorder logic with counting quantifiers are both in NEXPTIME, even when counting quantifiers are coded succinctly.
متن کاملComplexity of the Guarded Two-Variable Fragment with Counting Quantifiers
We show that the finite satisfiability problem for the guarded twovariable fragment with counting quantifiers is in EXPTIME. The method employed also yields a simple proof of the result obtained in Kazakov [6], that the satisfiability problem for the guarded two-variable fragment with counting quantifiers is in EXPTIME.
متن کاملData-Complexity of the Two-Variable Fragment with Counting Quantifiers
The data-complexity of both satisfiability and finite satisfiability for the two-variable fragment with counting is NP-complete; the data-complexity of both query-answering and finite query-answering for the two-variable guarded fragment with counting is co-NP-complete.
متن کاملThe Two-Variable Fragment with Counting Revisited
The satisfiability and finite satisfiability problems for the two-variable fragment of first-order logic with counting were shown in [5] to be in NExpTime. This paper presents a simplified proof via a result on integer programming due to Eisenbrand and Shmonina [2].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2021
ISSN: ['1076-9757', '1943-5037']
DOI: https://doi.org/10.1613/jair.1.12320